Appearance Matching with Partial Data ∗
نویسندگان
چکیده
Appearance matching methods use raw or filtered pixel brightness values to perform recognition. To expedite recognition, subspace methods are used to achieve compact representations of images. In many cases it is advantageous to recognize an image based on only a subset of its pixels, for example, when a part of an image is occluded, or to expedite recognition. Currently, such subsets are selected either randomly or using heuristics. In this paper, we derive criteria for selecting the pixel subsets through a sensitivity analysis of the subspace. Based on these criteria, we propose two practical recognition algorithms. These algorithms were tested on a large number of images with degraded or partial data. In addition to faster recognition, our algorithms yield high recognition accuracy.
منابع مشابه
Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملInformation Sampling for Appearance based 3D Object Recognition and Pose Estimation
This paper is concerned with overcoming three problems associated with appearance based matching. The first is partial occlusion; the second background variation and the third is determining which image points from a set of images acquired a priori are the most discriminating. These data, either a single point or a number scattered throughout an image, are extracted by applying a statistical me...
متن کاملAutomated Scene Matching in Movies
We describe progress in matching shots which are images of the same 3D scene in a film. The problem is hard because the camera viewpoint may change substantially between shots, with consequent changes in the imaged appearance of the scene due to foreshortening, scale changes and partial occlusion. We demonstrate that wide baseline matching techniques can be successfully employed for this task b...
متن کاملAppearance Tracker Based on Sparse Eigentemplate
A novel scheme is proposed for the efficient object tracking by using partial projections of a sparse set of pixels to eigenspaces. This paper shows a theoretical framework of the sparse eigentemplate matching and its application to a real-time face tracker. The sparse eigentemplate matching is formalized as a partial projection onto an eigenspace. Only using a small number of pixels, it facili...
متن کاملA Theory of Unique Hues and Colour Categories in the Human Colour Vision
A novel approach to assessing colour appearance is described. It is based on a new technique—partial hue-matching—which allows for measuring colour in terms of component hues objectively, without resorting to verbal definitions. The new method is believed to have a potential to be as exact as colorimetric techniques. In contrast to classical colour matching, which implies visual equivalence of ...
متن کامل